A novel Physarum-inspired competition algorithm for discrete multi-objective optimisation problems

نویسندگان

چکیده

Abstract Many real-world problems can be naturally formulated as discrete multi-objective optimisation (DMOO) problems. We have proposed a novel Physarum-inspired competition algorithm (PCA) to tackle these DMOO Our is based on hexagonal cellular automata (CA) representation of problem search space and reaction–diffusion systems that control the Physarum motility. Physarum’s decision-making power properties CA made our perfectly suitable approach solve Each cell in grid will decoded solution (objective function) regarded food resource attract Physarum. The n-dimensional generalisation has allowed us extend solving capabilities PCA from only 2-D n-D implemented restart procedure select global Pareto frontier both personal experience shared information. Extensive experimental statistical analyses were conducted several benchmark functions assess performance against other evolutionary algorithms. As far we know, this study first attempt algorithms problems, with large number indicators. confirmed assumption individual skills competing are more efficient exploration increase diversity solutions. It achieved best for Spread indicator (diversity), similar results compared strength (SPEA2) even outperformed well-established genetic

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Multi-Directional Modified Physarum Algorithm for Optimal Multi-Objective Discrete Decision Making

This paper will address an innovative bio-inspired algorithm able to incrementally grow decision graphs in multiple directions for discrete multi-objective optimisation. The algorithm takes inspiration from the slime mould Physarum Polycephalum, an amoeboid organism that in its plasmodium state extends and optimizes a net of veins looking for food. The algorithm is here used to solve multi-obje...

متن کامل

A Novel Coral Reefs Optimization Algorithm for Multi-objective Problems

In this paper we detail a new algorithm for multi-objective optimization, the Multi-Objective Coral Reefs Optimization (MO-CRO) algorithm. The algorithm is based on the simulation of the coral reefs processes, including corals’ reproduction and fight for the space in the reef. The adaptation to multi-objective problems is an easy process based on domination or non-domination during the process ...

متن کامل

A multi-tier adaptive grid algorithm for the evolutionary multi-objective optimisation of complex problems

The multi-tier Covariance Matrix Adaptation Pareto Archived Evolution Strategy (m-CMA-PAES) is an evolutionary multi-objective optimisation (EMO) algorithm for real-valued optimisation problems. It combines a nonelitist adaptive grid based selection scheme with the efficient strategy parameter adaptation of the elitist CovarianceMatrix Adaptation Evolution Strategy (CMA-ES). In the original CMA...

متن کامل

Multi-Objective Ant Colony Optimization Based on the Physarum-Inspired Mathematical Model for Bi-Objective Traveling Salesman Problems.

Bi-objective Traveling Salesman Problem (bTSP) is an important field in the operations research, its solutions can be widely applied in the real world. Many researches of Multi-objective Ant Colony Optimization (MOACOs) have been proposed to solve bTSPs. However, most of MOACOs suffer premature convergence. This paper proposes an optimization strategy for MOACOs by optimizing the initialization...

متن کامل

Physarum Learner: a novel structure learning algorithm for Bayesian Networks inspired by Physarum polycephalum

Two novel algorithms for learning Bayesian network structure from data based on the true slime mold Physarum polycephalum are introduced. The first algorithm called CPhyL calculates pairwise correlation coefficients in the dataset. Within an initially fully connected Physarum-Maze, the length of the connections is given by the inverse correlation coefficient between the connected nodes. Then, t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Soft Computing

سال: 2023

ISSN: ['1433-7479', '1432-7643']

DOI: https://doi.org/10.1007/s00500-023-08505-1